Some remark on the asymptotic variance in a drift accelerated diffusion
نویسندگان
چکیده
منابع مشابه
A remark on asymptotic enumeration of highest weights in tensor powers of a representation
We consider the semigroup $S$ of highest weights appearing in tensor powers $V^{otimes k}$ of a finite dimensional representation $V$ of a connected reductive group. We describe the cone generated by $S$ as the cone over the weight polytope of $V$ intersected with the positive Weyl chamber. From this we get a description for the asymptotic of the number of highest weights appearing in $V^{otime...
متن کاملA remark on Remainders of homogeneous spaces in some compactifications
We prove that a remainder $Y$ of a non-locally compact rectifiable space $X$ is locally a $p$-space if and only if either $X$ is a Lindel"{o}f $p$-space or $X$ is $sigma$-compact, which improves two results by Arhangel'skii. We also show that if a non-locally compact rectifiable space $X$ that is locally paracompact has a remainder $Y$ which has locally a $G_{delta}$-diagonal, then...
متن کاملA Remark on Mirzakhani’s Asymptotic Formulae
We give a short proof of Penner-Grushevsky-Schumacher-Trapani’s large genus asymptotics of Weil-Petersson volumes of moduli spaces of curves. We also study asymptotic expansions for certain integrals of pure ψ classes and answer a question of Mirzakhani on the asymptotic behavior of one-point volume polynomials of moduli spaces of curves.
متن کاملa remark on asymptotic enumeration of highest weights in tensor powers of a representation
we consider the semigroup $s$ of highest weights appearing in tensor powers $v^{otimes k}$ of a finite dimensional representation $v$ of a connected reductive group. we describe the cone generated by $s$ as the cone over the weight polytope of $v$ intersected with the positive weyl chamber. from this we get a description for the asymptotic of the number of highest weights appearing in $v^{otime...
متن کاملAsymptotic algorithm for computing the sample variance of interval data
The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics & Probability Letters
سال: 2020
ISSN: 0167-7152
DOI: 10.1016/j.spl.2020.108748